One of the two techniques for communicating between parallel processes (the other being shared memory). A common use of message passing is for communication in a parallel computer. A process running on one processor may send a message to a process running on the same processor or another. The actual transmission of the message is usually handled by the run-time support of the language in which the processes are written, or by the operating system. Message passing scales better than shared memory, which is generally used in computers with relatively few processors. This is because the total communications bandwidth usually increases with the number of processors. A message passing system provides primitives for sending and receiving messages. These primitives may by either synchronous or asynchronous or both. A synchronous send will not complete (will not allow the sender to proceed) until the receiving process has received the message. This allows the sender to know whether the message was received successfully or not (like when you speak to someone on the telephone). An asynchronous send simply queues the message for transmission without waiting for it to be received (like posting a letter). A synchronous receive primitive will wait until there is a message to read whereas an asynchronous receive will return immediately, either with a message or to say that no message has arrived. Messages may be sent to a named process or to a named mailbox which may be readable by one or many processes. Transmission involves determining the location of the recipient and then choosing a route to reach that location. The message may be transmitted in one go or may be split into packets which are transmitted independently (e.g. using wormhole routing) and reassembled at the receiver. The message passing system must ensure that sufficient memory is available to buffer the message at its destination and at intermediate nodes. Messages may be typed or untyped at the programming language level. They may have a priority, allowing the receiver to read the highest priority messages first. Some message passing computers are the {MIT J-Machine (http://ai.mit.edu/projects/cva/cva_j_machine.html)}, the {Illinois Concert Project (http://www-csag.cs.uiuc.edu/projects/concert.html)} and transputer-based systems. Object-oriented programming uses message passing between objects as a metaphor for procedure call. (1994-11-11)

Redundancy in United Kingdom law concerns the rights of employees if they are dismissed for economic reasons in UK labour law.

<algorithm> (CRC or "cyclic redundancy code") A number derived from, and stored or transmitted with, a block of data in order to detect corruption. By recalculating the CRC and comparing it to the value originally transmitted, the receiver can detect some types of transmission errors. A CRC is more complicated than a checksum. It is calculated using division either using shifts and exclusive ORs or table lookup (modulo 256 or 65536). The CRC is "redundant" in that it adds no information. A single corrupted bit in the data will result in a one bit change in the calculated CRC but multiple corrupted bits may cancel each other out. CRCs treat blocks of input bits as coefficient-sets for polynomials. E.g., binary 10100000 implies the polynomial: 1*x^7 + 0*x^6 + 1*x^5 + 0*x^4 + 0*x^3 + 0*x^2 + 0*x^1 + 0*x^0. This is the "message polynomial". A second polynomial, with constant coefficients, is called the "generator polynomial". This is divided into the message polynomial, giving a quotient and remainder. The coefficients of the remainder form the bits of the final CRC. So, an order-33 generator polynomial is necessary to generate a 32-bit CRC. The exact bit-set used for the generator polynomial will naturally affect the CRC that is computed. Most CRC implementations seem to operate 8 bits at a time by building a table of 256 entries, representing all 256 possible 8-bit byte combinations, and determining the effect that each byte will have. CRCs are then computed using an input byte to select a 16- or 32-bit value from the table. This value is then used to update the CRC. Ethernet packets have a 32-bit CRC. Many disk formats include a CRC at some level. (1997-08-02)

cyclic redundancy check

A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to digital data. Blocks of data entering these systems get a short check value attached, based on the remainder of a polynomial division of their contents.

In computing, a private message, personal message, or direct message (abbreviated as PM or DM) refers to a private communication sent or received by a user of a private communication channel on any given platform. Unlike public posts, PMs are only viewable by the participants.

In cryptography, a message authentication code (MAC), sometimes known as a tag, is a short piece of information used for authenticating a message. In other words, to confirm that the message came from the stated sender (its authenticity) and has not been changed.

A variable- (also changeable-, electronic-, or dynamic-) message sign, often abbreviated VMS, CMS, or DMS, and in the UK known as a matrix sign,

The King's Christmas Message (also known as The Queen's Christmas Message in the reign of a female monarch, formally as His Majesty's Most Gracious Speech, and informally as the Royal Christmas Message) is a broadcast made by the sovereign of the United Kingdom and the other Commonwealth realms to the Commonwealth of Nations each Christmas. The tradition began in 1932 with a radio broadcast by King George V on the British Broadcasting Corporation's Empire Service.

MicroSoft Message Queue [Additional explanations: server] (Reference: MS)